On Integrated Ant Colony Optimization Strategies for Improved Channel Allocation in Large Scale Wireless Communications

نویسندگان

  • P. M. PAPAZOGLOU
  • D. A. KARRAS
  • R. C. PAPADEMETRIOU
چکیده

Recently, various sophisticated strategies adapted to current network conditions have been proposed for channel allocation based on intelligent techniques such as evolutionary and genetic algorithms. These approaches constitute heuristic solutions to resource management problems in modern cellular systems. On the other hand, the ant colony optimization approach has been proposed for solving several optimization problems with promising results. It would be interesting, therefore, to investigate its application in resource management problems of wireless systems. A comprehensive and efficient heuristic approach for solving the channel allocation problem in large scale wireless communication systems, based on intelligent techniques and especially on integrating multi-agent methodology and ant colony optimization strategies, is herein proposed. Moreover, important implementation issues of ant colony optimization within a multi-agent simulation system are investigated. In addition, multi-agent realization issues such as thread execution sequence definition are also presented. An initial but comprehensive simulation study has been conducted and the simulation results show the performance improvement of the proposed ant colony optimization algorithm as well as the multi-agent modelling approach with respect to traditional network performance statistics. Key-words: Channel allocation, intelligent techniques, wireless network simulation, multi-agents, ant colony

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Harmony search algorithm and Ant Colony Optimization algorithm to increase the lifetime of Wireless Sensor Networks

Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...

متن کامل

Optimal Distributed Generation (DG) Allocation in Distribution Networks using an Improved Ant Colony Optimization (ACO) Algorithm

Abstract: The development of distributed generation (DGs) units in recent years have created challenges in the operation of power grids, especially distribution networks. One of these issues is the optimal allocation (location and capacity) of these units in distribution networks. In this thesis, a method based on the improved ant colony optimization algorithm is presented to solve the problem ...

متن کامل

An Ant-Colony Optimization Clustering Model for Cellular Automata Routing in Wireless Sensor Networks

High efficient routing is an important issue for the design of wireless sensor network (WSN) protocols to meet the severe hardware and resource constraints. This paper presents an inclusive evolutionary reinforcement method. The proposed approach is a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every agent...

متن کامل

Mobile Agent Routing Algorithm in Wireless Sensor Networks

Wireless sensor network is resources-restricted network and similar to traditional mobile ad-hoc networks in the sense that both involve multi-hop communications. An improved ant colony algorithm based on ant colony system is put forward which to find the initial optimal migration path for mobile agent in wireless sensor networks environment. This improved algorithm selects a part of optimal ro...

متن کامل

An Ant Colony Optimization Algorithm for Network Vulnerability Analysis

Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008